//#pragma comment(linker,"/STACK:16777216") /*16Mb*/
//#pragma comment(linker,"/STACK:33554432") /*32Mb*/
#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<numeric>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<memory>
#include<string>
#include<vector>
#include<cctype>
#include<list>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;

typedef unsigned long long      ui64;
typedef long long               i64;
typedef	vector<int>             VI;
typedef	vector<bool>            VB;
typedef	vector<VI>              VVI;
typedef	vector<string>          VS;
typedef	pair<int,int>           PII;
typedef map<string,int>         MSI;
typedef set<int>                SI;
typedef set<string>             SS;
typedef map<int,int>            MII;
typedef	pair<double,double>     PDD;

#define PB                      push_back
#define MP                      make_pair
#define X                       first
#define Y                       second
#define FOR(i, a, b)            for(int i = (a); i < (b); ++i)
#define RFOR(i, a, b)           for(int i = (a) - 1; i >= (b); --i)
#define CLEAR(a, b)             memset(a, b, sizeof(a))
#define SZ(a)                   int((a).size())
#define ALL(a)                  (a).begin(), (a).end()
#define RALL(a)                 (a).rbegin(), (a).rend()
#define INF                     (2000000000)


int main()
{
	int n;
	cin >> n;
	set<vector<string> > S;
	FOR(i,0,n) {
		int k;
		cin >> k;
		VS r(k);
		FOR(j,0,k)
			cin >> r[j];
		S.insert(r);
	}

	int r1,r2;
	int k;
	cin >> r1 >> r2 >> k;
	string add = "";
	int res = -1;
	FOR(i,0,k) {
		string c;
		int r;
		cin >> c >> r;
		//Efremov = govno
		VS q;
		q.PB("Efremov");
		q.PB("Kantorov");
		q.PB(c);
		sort(ALL(q));
		int Rating = r1+r2+r;
		if(S.find(q)!=S.end()) {
			q.clear();
			q.PB("Kantorov");
			q.PB(c);
			sort(ALL(q));
			if(S.find(q)!=S.end()) {}
			else
				if( Rating-r1 > res ) {
					res = Rating-r1;
					add = c;
				}
		}
		else {
			if( Rating > res ) {
				res = Rating;
				add = c;
			}
		}
	}
	if(res==-1)
		cout << "Fail\n";
	else
		cout << "Win\n" << add << endl;

	return 0;
}